Entanglement entropies in free fermion gases for arbitrary dimension

We study the entanglement entropy of connected bipartitions in free fermion gases of N particles in arbitrary dimension d. We show that the von Neumann and Renyi entanglement entropies grow asymptotically as N^(1-1/d) ln N, with a prefactor that is analytically computed using the Widom conjecture both for periodic and open boundary conditions. The logarithmic correction to the power-law behavior is related to the area-law violation in lattice free fermions. These asymptotic large-N behaviors are checked against exact numerical calculations for N-particle systems.Comment: 6 pages, 9 fig

Formation of molecular oxygen in ultracold O + OH reaction

We discuss the formation of molecular oxygen in ultracold collisions between hydroxyl radicals and atomic oxygen. A time-independent quantum formalism based on hyperspherical coordinates is employed for the calculations. Elastic, inelastic and reactive cross sections as well as the vibrational and rotational populations of the product O2 molecules are reported. A J-shifting approximation is used to compute the rate coefficients. At temperatures T = 10 - 100 mK for which the OH molecules have been cooled and trapped experimentally, the elastic and reactive rate coefficients are of comparable magnitude, while at colder temperatures, T < 1 mK, the formation of molecular oxygen becomes the dominant pathway. The validity of a classical capture model to describe cold collisions of OH and O is also discussed. While very good agreement is found between classical and quantum results at T=0.3 K, at higher temperatures, the quantum calculations predict a larger rate coefficient than the classical model, in agreement with experimental data for the O + OH reaction. The zero-temperature limiting value of the rate coefficient is predicted to be about 6.10^{-12} cm^3 molecule^{-1} s^{-1}, a value comparable to that of barrierless alkali-metal atom - dimer systems and about a factor of five larger than that of the tunneling dominated F + H2 reaction.Comment: 9 pages, 8 figure

On the Complexity of Computing Two Nonlinearity Measures

We study the computational complexity of two Boolean nonlinearity measures: the nonlinearity and the multiplicative complexity. We show that if one-way functions exist, no algorithm can compute the multiplicative complexity in time $2^{O(n)}$ given the truth table of length $2^n$, in fact under the same assumption it is impossible to approximate the multiplicative complexity within a factor of $(2-\epsilon)^{n/2}$. When given a circuit, the problem of determining the multiplicative complexity is in the second level of the polynomial hierarchy. For nonlinearity, we show that it is #P hard to compute given a function represented by a circuit

Distributed Minimum Cut Approximation

We study the problem of computing approximate minimum edge cuts by distributed algorithms. We use a standard synchronous message passing model where in each round, $O(\log n)$ bits can be transmitted over each edge (a.k.a. the CONGEST model). We present a distributed algorithm that, for any weighted graph and any $\epsilon \in (0, 1)$, with high probability finds a cut of size at most $O(\epsilon^{-1}\lambda)$ in $O(D) + \tilde{O}(n^{1/2 + \epsilon})$ rounds, where $\lambda$ is the size of the minimum cut. This algorithm is based on a simple approach for analyzing random edge sampling, which we call the random layering technique. In addition, we also present another distributed algorithm, which is based on a centralized algorithm due to Matula [SODA '93], that with high probability computes a cut of size at most $(2+\epsilon)\lambda$ in $\tilde{O}((D+\sqrt{n})/\epsilon^5)$ rounds for any $\epsilon>0$. The time complexities of both of these algorithms almost match the $\tilde{\Omega}(D + \sqrt{n})$ lower bound of Das Sarma et al. [STOC '11], thus leading to an answer to an open question raised by Elkin [SIGACT-News '04] and Das Sarma et al. [STOC '11]. Furthermore, we also strengthen the lower bound of Das Sarma et al. by extending it to unweighted graphs. We show that the same lower bound also holds for unweighted multigraphs (or equivalently for weighted graphs in which $O(w\log n)$ bits can be transmitted in each round over an edge of weight $w$), even if the diameter is $D=O(\log n)$. For unweighted simple graphs, we show that even for networks of diameter $\tilde{O}(\frac{1}{\lambda}\cdot \sqrt{\frac{n}{\alpha\lambda}})$, finding an $\alpha$-approximate minimum cut in networks of edge connectivity $\lambda$ or computing an $\alpha$-approximation of the edge connectivity requires $\tilde{\Omega}(D + \sqrt{\frac{n}{\alpha\lambda}})$ rounds

Sparser Random 3SAT Refutation Algorithms and the Interpolation Problem:Extended Abstract

We formalize a combinatorial principle, called the 3XOR principle, due to Feige, Kim and Ofek [12], as a family of unsatisfiable propositional formulas for which refutations of small size in any propo-sitional proof system that possesses the feasible interpolation property imply an efficient deterministic refutation algorithm for random 3SAT with n variables and Ω(n1.4) clauses. Such small size refutations would improve the state of the art (with respect to the clause density) efficient refutation algorithm, which works only for Ω(n1.5) many clauses [13]. We demonstrate polynomial-size refutations of the 3XOR principle in resolution operating with disjunctions of quadratic equations with small integer coefficients, denoted R(quad); this is a weak extension of cutting planes with small coefficients. We show that R(quad) is weakly autom-atizable iff R(lin) is weakly automatizable, where R(lin) is similar to R(quad) but with linear instead of quadratic equations (introduced in [25]). This reduces the problem of refuting random 3CNF with n vari-ables and Ω(n1.4) clauses to the interpolation problem of R(quad) and to the weak automatizability of R(lin)